Lattices with exponentially large kissing numbers
نویسندگان
چکیده
منابع مشابه
Packings with large minimum kissing numbers
For each proper power of 4, n, we describe a simple explicit construction of a finite collection of pairwise disjoint open unit balls in R in which each ball touches more than 2 √ n others. A packing of balls in the Euclidean space is a finite or infinite collection of pairwise disjoint open unit balls in Rn. It is called a lattice packing if the centers of the balls form a lattice in Rn. The m...
متن کاملExponentially fragile PT symmetry in lattices with localized eigenmodes.
We study the effect of localized modes in lattices of size N with parity-time (PT) symmetry. Such modes are arranged in pairs of quasidegenerate levels with splitting delta approximately exp(-N/xi) where xi is their localization length. The level "evolution" with respect to the PT breaking parameter gamma shows a cascade of bifurcations during which a pair of real levels becomes complex. The sp...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملToeplitz band matrices with exponentially growing condition numbers
The paper deals with the spectral condition numbers (Tn(b)) of sequences of Toeplitz matrices Tn(b) = (bj k) n j;k=1 as n goes to in nity. The function b(ei ) = P k bke ik is referred to as the symbol of the sequence fTn(b)g. It is well known that (Tn(b)) may increase exponentially if the symbol b has very strong zeros on the unit circle T = fz 2 C : jzj = 1g, for example, if b vanishes on some...
متن کاملComputations with Large Numbers
Since any personal computer has a limited range of integer values, therefore, it will result in an integer overflow when a program tries to compute a value larger than machine’s maximum value. We will discuss a workable algorithm that will be able to deal with any large numbers without getting an integer overflow.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Moscow Journal of Combinatorics and Number Theory
سال: 2019
ISSN: 2640-7361,2220-5438
DOI: 10.2140/moscow.2019.8.163